منابع مشابه
Rounds in a combinatorial search problem
We consider the following combinatorial search problem: we are given some excellent elements of [n] and we should find at least one, asking questions of the following type: ”Is there an excellent element in A ⊂ [n]?”. G.O.H. Katona [6] proved sharp results for the number of questions needed to ask in the adaptive, non-adaptive and two-round versions of this problem. We verify a conjecture of Ka...
متن کاملRounds in Combinatorial
The search complexity of a separating system H ⊆ 2 is the minimum number of questions of type “x ∈ H? ” (where H ∈ H) needed in the worst case to determine a hidden element x ∈ [m]. If we are allowed to ask the questions in at most k batches then we speak of the k-round (or k-stage) complexity of H, denoted by ck(H). While 1-round and m-round complexities (called non-adaptive and adaptive compl...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملResearch Challenges in Combinatorial Search
I provide a personal view of some of the major research challenges in the area of combinatorial search. These include solving and playing games with chance, hidden information, and multiple players, optimally solving larger instances of well-known single-agent toy problems, applying search techniques to more realistic problem domains, analyzing the time complexity of heuristic search algorithms...
متن کاملCombinatorial Meta Search
Machine learning approaches to computational creativity learn a generative model from a set of exemplars. We introduce combinatorial meta search, an approach for manipulating and combining different learned generative models. We hypothesize that combinatorial meta search can discover new generative models for which data may never have existed and thus expand the space of possible creative artif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9750-y